51f5955c5712b5a5d2ad90d7234056d96d89ead7,src/main/java/org/highj/data/impl/treeMap/Node.java,Node,balanceR,#Color#number#K#V#Node#Node#,231

Before Change


    }

    private static <K, V> Node<K, V> balanceR(Color c, int bh, K k, V v, Node<K, V> left, Node<K, V> right) {
        if ((c == BLACK) && left.color == RED && right.color == RED) {
            return new Node<>(RED, bh + 1, k, v, left.turn(BLACK), right.turn(BLACK));
        } else if (right.color == RED) {
            Node<K, V> newLeft = new Node<>(RED, right.bHeight, k, v, left, right.left);
            return new Node<>(c, bh, right.key, right.value, newLeft, right.right);
        } else {
            return new Node<>(c, bh, k, v, left, right);
        }

After Change


        }
    }

    private static <K, V> Node<K, V> balanceR(Color c, int bh, K k, V v, Node<K, V> left, Node<K, V> right) {
        if ((c == BLACK) && left.isRed() && right.isRed()) {
            return red(bh + 1, k, v, left.turn(BLACK), right.turn(BLACK));
        } else if (right.isRed()) {
            Node<K, V> newLeft = red(right.bHeight, k, v, left, right.left);
            return node(c, bh, right.key, right.value, newLeft, right.right);